Model Checking for Verification of Quantum Circuits

Verification of Quantum Cryptography Protocols by Model Checking

Unlike classical cryptography which is based on mathematical functions, Quantum Cryptography or Quantum Key Distribution (QKD) exploits the laws of quantum physics to offer unconditionally secure communication. The progress of research in this field allows the anticipation of QKD to be available outside of laboratories within the next few years and efforts are made to improve the performance an...

Oracle Circuits for Branching-Time Model Checking

A special class of oracle circuits with tree-vector form is introduced. It is shown that they can be evaluated in deterministic polynomial-time with a polylog number of adaptive queries to an NP oracle. This framework allows us to evaluate the precise computational complexity of model checking for some branching-time logics where it was known that the problem is NP-hard and coNP-hard.

Iterative Verification Techniques for CTL Model Checking

A paradigm for automatic approximation/refinement in conservative CTL model checking is presented. The approximations are used to verify a given formula conservatively by computing upper and/or lower bounds to the set of satisfying states at each subformula. These approximations attempt to perform conservative verification with the least possible number of BDD variables and BDD nodes. We presen...

Incremental Verification Techniques for CTL Model Checking

Incremental Verification Techniques for CTL Model Checking

A paradigm for automatic approximation/refinement in conservative CTL model checking is presented. The approximations are used to verify a given formula conservatively by computing upper and lower bounds to the set of satisfying states at each sub-formula. These approximations attempt to perform conservative verification with the least possible number of BDD variables and BDD nodes. We present ...